
<!DOCTYPE HTML>
<html lang="zh-hans" >
    <head>
        <meta charset="UTF-8">
        <meta content="text/html; charset=utf-8" http-equiv="Content-Type">
        <title>2.深搜题目集 · 计算机 ,java , 大数据 基础知识体系</title>
        <meta http-equiv="X-UA-Compatible" content="IE=edge" />
        <meta name="description" content="">
        <meta name="generator" content="GitBook 3.2.3">
        <meta name="author" content="hzh">
        
        
    
    <link rel="stylesheet" href="../gitbook/style.css">

    
            
                
                <link rel="stylesheet" href="../gitbook/gitbook-plugin-splitter/splitter.css">
                
            
                
                <link rel="stylesheet" href="../gitbook/gitbook-plugin-expandable-chapters-small/expandable-chapters-small.css">
                
            
                
                <link rel="stylesheet" href="../gitbook/gitbook-plugin-anchors/plugin.css">
                
            
                
                <link rel="stylesheet" href="../gitbook/gitbook-plugin-anchor-navigation-ex/style/plugin.css">
                
            
                
                <link rel="stylesheet" href="../gitbook/gitbook-plugin-expandable-chapters/expandable-chapters.css">
                
            
                
                <link rel="stylesheet" href="../gitbook/gitbook-plugin-toggle-chapters/toggle.css">
                
            
                
                <link rel="stylesheet" href="../gitbook/gitbook-plugin-back-to-top-button/plugin.css">
                
            
                
                <link rel="stylesheet" href="../gitbook/gitbook-plugin-code/plugin.css">
                
            
                
                <link rel="stylesheet" href="../gitbook/gitbook-plugin-search-pro/search.css">
                
            
                
                <link rel="stylesheet" href="../gitbook/gitbook-plugin-pageview-count/plugin.css">
                
            
                
                <link rel="stylesheet" href="../gitbook/gitbook-plugin-highlight/website.css">
                
            
                
                <link rel="stylesheet" href="../gitbook/gitbook-plugin-fontsettings/website.css">
                
            
        

    

    
        
    

        
    
    
    
    <meta name="HandheldFriendly" content="true"/>
    <meta name="viewport" content="width=device-width, initial-scale=1, user-scalable=no">
    <meta name="apple-mobile-web-app-capable" content="yes">
    <meta name="apple-mobile-web-app-status-bar-style" content="black">
    <link rel="apple-touch-icon-precomposed" sizes="152x152" href="../gitbook/images/apple-touch-icon-precomposed-152.png">
    <link rel="shortcut icon" href="../gitbook/images/favicon.ico" type="image/x-icon">

    
    <link rel="next" href="3.广度优先搜索.html" />
    
    
    <link rel="prev" href="2.深度优先搜索.html" />
    

    
    
    
    

    </head>
    <body>
        
<div class="book">
    <div class="book-summary">
        
            
<div id="book-search-input" role="search">
    <input type="text" placeholder="输入并搜索" />
</div>

            
                <nav role="navigation">
                


<ul class="summary">
    
    

    

    
        
        <li class="header">操作系统</li>
        
        
    
        <li class="chapter " data-level="1.1" data-path="../">
            
                <a href="../">
            
                    
                    Introduction
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.2" data-path="../操作系统/1.基本概述.html">
            
                <a href="../操作系统/1.基本概述.html">
            
                    
                    1.操作系统基本概述
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.3" data-path="../操作系统/2.进程管理之进程与线程.html">
            
                <a href="../操作系统/2.进程管理之进程与线程.html">
            
                    
                    2.进程管理之进程与线程
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.4" data-path="../操作系统/3.进程管理之处理机调度.html">
            
                <a href="../操作系统/3.进程管理之处理机调度.html">
            
                    
                    3.进程管理之处理机调度
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.5" data-path="../操作系统/4.进程管理之进程同步.html">
            
                <a href="../操作系统/4.进程管理之进程同步.html">
            
                    
                    4.进程管理之进程同步
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.6" data-path="../操作系统/5.内存管理之基本概念.html">
            
                <a href="../操作系统/5.内存管理之基本概念.html">
            
                    
                    5.内存管理之基本概念
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.7" data-path="../操作系统/6.内存管理之虚拟内存.html">
            
                <a href="../操作系统/6.内存管理之虚拟内存.html">
            
                    
                    6.内存管理之虚拟内存
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.8" data-path="../操作系统/7.IO设备管理之基本概念.html">
            
                <a href="../操作系统/7.IO设备管理之基本概念.html">
            
                    
                    7.IO设备管理之基本概念
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.9" data-path="../操作系统/8.面试题总结一.html">
            
                <a href="../操作系统/8.面试题总结一.html">
            
                    
                    8.面试题总结一
            
                </a>
            

            
        </li>
    

    
        
        <li class="header">计算机网络篇</li>
        
        
    
        <li class="chapter " data-level="2.1" data-path="../计算机网络/1.计算机网络入门基础概念.html">
            
                <a href="../计算机网络/1.计算机网络入门基础概念.html">
            
                    
                    1.计算机网络入门文章(必读)
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="2.2" data-path="../计算机网络/2.计算机网络通信基础.html">
            
                <a href="../计算机网络/2.计算机网络通信基础.html">
            
                    
                    2.计算机网络通信入门文章(必读)
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="2.3" data-path="../计算机网络/3.数据链路层.html">
            
                <a href="../计算机网络/3.数据链路层.html">
            
                    
                    3.数据链路层
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="2.4" data-path="../计算机网络/4.网络层1.html">
            
                <a href="../计算机网络/4.网络层1.html">
            
                    
                    4.网络层(一)
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="2.5" data-path="../计算机网络/5.网络层2.html">
            
                <a href="../计算机网络/5.网络层2.html">
            
                    
                    5.网络层(二)
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="2.6" data-path="../计算机网络/6.传输层.html">
            
                <a href="../计算机网络/6.传输层.html">
            
                    
                    6.传输层
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="2.7" data-path="../计算机网络/7.应用层.html">
            
                <a href="../计算机网络/7.应用层.html">
            
                    
                    7.应用层(⭐)
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="2.8" data-path="../计算机网络/10.HTTP相关协议.html">
            
                <a href="../计算机网络/10.HTTP相关协议.html">
            
                    
                    8.HTTP相关及发展
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="2.9" >
            
                <span>
            
                    
                    9.websocket
            
                </span>
            

            
        </li>
    
        <li class="chapter " data-level="2.10" data-path="../计算机网络/9.面试题二.html">
            
                <a href="../计算机网络/9.面试题二.html">
            
                    
                    面试题总结一
            
                </a>
            

            
        </li>
    

    
        
        <li class="header">数据结构篇</li>
        
        
    
        <li class="chapter " data-level="3.1" data-path="../数据结构/1.图论.html">
            
                <a href="../数据结构/1.图论.html">
            
                    
                    1.图论
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="3.2" data-path="../数据结构/2.图论例题.html">
            
                <a href="../数据结构/2.图论例题.html">
            
                    
                    2.图论例题
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="3.3" data-path="../数据结构/3.散列表.html">
            
                <a href="../数据结构/3.散列表.html">
            
                    
                    3.散列表
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="3.4" data-path="../数据结构/4.排序算法.html">
            
                <a href="../数据结构/4.排序算法.html">
            
                    
                    4.排序算法
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="3.5" data-path="../数据结构/5.排序列题.html">
            
                <a href="../数据结构/5.排序列题.html">
            
                    
                    5.排序算法例题
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="3.6" data-path="../数据结构/6.树论.html">
            
                <a href="../数据结构/6.树论.html">
            
                    
                    6.树论
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="3.7" data-path="../数据结构/7.树论例题.html">
            
                <a href="../数据结构/7.树论例题.html">
            
                    
                    7.树论例题.md
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="3.8" data-path="../数据结构/9.模板.html">
            
                <a href="../数据结构/9.模板.html">
            
                    
                    数据结构模板
            
                </a>
            

            
        </li>
    

    
        
        <li class="header">算法篇</li>
        
        
    
        <li class="chapter " data-level="4.1" data-path="leetCode周赛题解.html">
            
                <a href="leetCode周赛题解.html">
            
                    
                    leetCode周赛记录
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="4.2" data-path="1.时间复杂度.html">
            
                <a href="1.时间复杂度.html">
            
                    
                    1.时间复杂度
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="4.3" data-path="2.深度优先搜索.html">
            
                <a href="2.深度优先搜索.html">
            
                    
                    2.深度优先搜索算法
            
                </a>
            

            
        </li>
    
        <li class="chapter active" data-level="4.4" data-path="2.深度优先搜索题目集.html">
            
                <a href="2.深度优先搜索题目集.html">
            
                    
                    2.深搜题目集
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="4.5" data-path="3.广度优先搜索.html">
            
                <a href="3.广度优先搜索.html">
            
                    
                    3.广度优先搜索算法
            
                </a>
            

            
        </li>
    

    
        
        <li class="header">JVM篇</li>
        
        
    
        <li class="chapter " data-level="5.1" data-path="../jvm/1.jvm内存结构.html">
            
                <a href="../jvm/1.jvm内存结构.html">
            
                    
                    1.jvm内存结构
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="5.2" data-path="../jvm/2.HotSpot虚拟机对象探秘.html">
            
                <a href="../jvm/2.HotSpot虚拟机对象探秘.html">
            
                    
                    2.HotSpot虚拟机对象探秘.md
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="5.3" data-path="../jvm/3.对象存亡与垃圾收集算法.html">
            
                <a href="../jvm/3.对象存亡与垃圾收集算法.html">
            
                    
                    3.对象存亡与垃圾收集算法.md
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="5.4" data-path="../jvm/4.HotSpot的算法细节与垃圾收集器.html">
            
                <a href="../jvm/4.HotSpot的算法细节与垃圾收集器.html">
            
                    
                    4.HotSpot的算法细节与垃圾收集器.md
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="5.5" data-path="../jvm/5.内存分配与回收策略.html">
            
                <a href="../jvm/5.内存分配与回收策略.html">
            
                    
                    5.内存分配与回收策略.md
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="5.6" data-path="../jvm/6.类文件结构.html">
            
                <a href="../jvm/6.类文件结构.html">
            
                    
                    6.类文件结构.md
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="5.7" data-path="../jvm/7.类加载机制.html">
            
                <a href="../jvm/7.类加载机制.html">
            
                    
                    7.类加载机制.md
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="5.8" data-path="../jvm/8.jvm逃逸分析.html">
            
                <a href="../jvm/8.jvm逃逸分析.html">
            
                    
                    8.逃逸分析技术
            
                </a>
            

            
        </li>
    

    
        
        <li class="header">多线程篇</li>
        
        
    
        <li class="chapter " data-level="6.1" data-path="../多线程/basic/0.多线程路线图.html">
            
                <a href="../多线程/basic/0.多线程路线图.html">
            
                    
                    1.多线程学习路线图
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="6.2" data-path="../多线程/basic/0.java内存模型与线程.html">
            
                <a href="../多线程/basic/0.java内存模型与线程.html">
            
                    
                    2.java内存模型与线程
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="6.3" data-path="../多线程/3.并行程序基础.html">
            
                <a href="../多线程/3.并行程序基础.html">
            
                    
                    2.并行程序基础
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="6.4" data-path="../多线程/basic/0.jhappenBefore与jvm指令重排.html">
            
                <a href="../多线程/basic/0.jhappenBefore与jvm指令重排.html">
            
                    
                    3.happenBefore与jvm指令重排序
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="6.5" data-path="../多线程/basic/1.synchronized与volatile.html">
            
                <a href="../多线程/basic/1.synchronized与volatile.html">
            
                    
                    4.synchronized与volatile.md
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="6.6" data-path="../多线程/basic/2.ThreadLocal.html">
            
                <a href="../多线程/basic/2.ThreadLocal.html">
            
                    
                    5.ThreadLocal.md
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="6.7" data-path="../多线程/cas/1.乐观锁与悲观锁.html">
            
                <a href="../多线程/cas/1.乐观锁与悲观锁.html">
            
                    
                    6.乐观锁与悲观锁.md
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="6.8" data-path="../多线程/cas/2.CAS与atomic类.html">
            
                <a href="../多线程/cas/2.CAS与atomic类.html">
            
                    
                    7.CAS与atomic类.md
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="6.9" data-path="../多线程/aqs/1.AQS.html">
            
                <a href="../多线程/aqs/1.AQS.html">
            
                    
                    8.AQS.md
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="6.10" data-path="../多线程/aqs/2.基于AQS的并发工具.html">
            
                <a href="../多线程/aqs/2.基于AQS的并发工具.html">
            
                    
                    9.基于AQS的并发工具.md
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="6.11" data-path="../多线程/blockingQueue/1.阻塞队列.html">
            
                <a href="../多线程/blockingQueue/1.阻塞队列.html">
            
                    
                    10.阻塞队列.md
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="6.12" data-path="../多线程/pond/1.线程池与底层原理.html">
            
                <a href="../多线程/pond/1.线程池与底层原理.html">
            
                    
                    11.线程池与底层原理.md
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="6.13" data-path="../多线程/10面试题一.html">
            
                <a href="../多线程/10面试题一.html">
            
                    
                    12.面试题一
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="6.14" data-path="../多线程/10面试题二.html">
            
                <a href="../多线程/10面试题二.html">
            
                    
                    13.面试题二.md
            
                </a>
            

            
        </li>
    

    
        
        <li class="header">java集合篇</li>
        
        
    
        <li class="chapter " data-level="7.1" data-path="../basic/collection/1.java集合.html">
            
                <a href="../basic/collection/1.java集合.html">
            
                    
                    1.集合架构
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="7.2" data-path="../basic/collection/2.HashMap源码分析.html">
            
                <a href="../basic/collection/2.HashMap源码分析.html">
            
                    
                    2.hashMap底层原理
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="7.3" data-path="../basic/collection/3.ConcurrentHashMap分析.html">
            
                <a href="../basic/collection/3.ConcurrentHashMap分析.html">
            
                    
                    3.ConcurrentHashMap分析
            
                </a>
            

            
        </li>
    

    
        
        <li class="header">设计模式篇</li>
        
        
    
        <li class="chapter " data-level="8.1" >
            
                <span>
            
                    
                    1.创造型模式
            
                </span>
            

            
        </li>
    
        <li class="chapter " data-level="8.2" data-path="../设计模式/factory/三种工厂模式介绍.html">
            
                <a href="../设计模式/factory/三种工厂模式介绍.html">
            
                    
                    三种工厂模式
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="8.3" data-path="../设计模式/factory/实战工厂模式.html">
            
                <a href="../设计模式/factory/实战工厂模式.html">
            
                    
                    实战工厂模式
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="8.4" data-path="../设计模式/factory/实战抽象工厂模式.html">
            
                <a href="../设计模式/factory/实战抽象工厂模式.html">
            
                    
                    实战抽象工厂模式
            
                </a>
            

            
        </li>
    

    
        
        <li class="header">mysql篇</li>
        
        
    
        <li class="chapter " data-level="9.1" data-path="../数据库/mysql/1.b树b+树的底层原理.html">
            
                <a href="../数据库/mysql/1.b树b+树的底层原理.html">
            
                    
                    1.mysql索引基础之b树与b+树⭐⭐
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="9.2" data-path="../数据库/mysql/2.mysql索引.html">
            
                <a href="../数据库/mysql/2.mysql索引.html">
            
                    
                    2.mysql索引及优化⭐⭐⭐⭐
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="9.3" data-path="../数据库/mysql/3.mysql存储引擎.html">
            
                <a href="../数据库/mysql/3.mysql存储引擎.html">
            
                    
                    3.mysql存储引擎.md
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="9.4" data-path="../数据库/mysql/4.多版本并发控制之mvcc原理.html">
            
                <a href="../数据库/mysql/4.多版本并发控制之mvcc原理.html">
            
                    
                    4.多版本并发控制之mvcc原理
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="9.5" data-path="../数据库/mysql/4.mysql事务.html">
            
                <a href="../数据库/mysql/4.mysql事务.html">
            
                    
                    5.mysql事务
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="9.6" data-path="../数据库/mysql/5.mysql锁机制.html">
            
                <a href="../数据库/mysql/5.mysql锁机制.html">
            
                    
                    6.mysql的锁机制
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="9.7" data-path="../数据库/mysql/6.mysql面试题一.html">
            
                <a href="../数据库/mysql/6.mysql面试题一.html">
            
                    
                    7.mysql面试题一
            
                </a>
            

            
        </li>
    

    
        
        <li class="header">高并发中间件篇</li>
        
        
    

    
        
        <li class="header">架构理论篇</li>
        
        
    
        <li class="chapter " data-level="11.1" data-path="../架构/0.架构演进.html">
            
                <a href="../架构/0.架构演进.html">
            
                    
                    1.架构演进
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="11.2" data-path="../架构/0.微服务架构与soa架构.html">
            
                <a href="../架构/0.微服务架构与soa架构.html">
            
                    
                    2.微服务架构与soa架构
            
                </a>
            

            
        </li>
    

    
        
        <li class="header">高可用系统篇</li>
        
        
    
        <li class="chapter " data-level="12.1" data-path="../高可用架构/1.限流.html">
            
                <a href="../高可用架构/1.限流.html">
            
                    
                    1.系统限流
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="12.2" data-path="../高可用系统/2.服务熔断.html">
            
                <a href="../高可用系统/2.服务熔断.html">
            
                    
                    2.服务熔断
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="12.3" data-path="../高可用系统/3.服务降级.html">
            
                <a href="../高可用系统/3.服务降级.html">
            
                    
                    3.服务降级
            
                </a>
            

            
        </li>
    

    
        
        <li class="header">spring-cloud 微服务篇</li>
        
        
    

    

    <li class="divider"></li>

    <li>
        <a href="https://www.gitbook.com" target="blank" class="gitbook-link">
            本书使用 GitBook 发布
        </a>
    </li>
</ul>


                </nav>
            
        
    </div>

    <div class="book-body">
        
            <div class="body-inner">
                
                    

<div class="book-header" role="navigation">
    

    <!-- Title -->
    <h1>
        <i class="fa fa-circle-o-notch fa-spin"></i>
        <a href=".." >2.深搜题目集</a>
    </h1>
</div>




                    <div class="page-wrapper" tabindex="-1" role="main">
                        <div class="page-inner">
                            
<div id="book-search-results">
    <div class="search-noresults">
    
                                <section class="normal markdown-section">
                                
                                <div id="anchor-navigation-ex-navbar"><i class="fa fa-navicon"></i><ul><ul><li><span class="title-icon "></span><a href="#&#x4E00;-&#x56DE;&#x6714;&#x7C7B;&#x578B;"><b></b>&#x4E00; &#x56DE;&#x6714;&#x7C7B;&#x578B;</a></li></ul></ul></div><a href="#" id="anchorNavigationExGoTop"><i class="fa fa-arrow-up"></i></a><h2 id="&#x4E00;-&#x56DE;&#x6714;&#x7C7B;&#x578B;"><a name="&#x4E00;-&#x56DE;&#x6714;&#x7C7B;&#x578B;" class="anchor-navigation-ex-anchor" href="#&#x4E00;-&#x56DE;&#x6714;&#x7C7B;&#x578B;"><i class="fa fa-link" aria-hidden="true"></i></a><a name="&#x4E00;-&#x56DE;&#x6714;&#x7C7B;&#x578B;" class="plugin-anchor" href="#&#x4E00;-&#x56DE;&#x6714;&#x7C7B;&#x578B;"><i class="fa fa-link" aria-hidden="true"></i></a>&#x4E00; &#x56DE;&#x6714;&#x7C7B;&#x578B;</h2>
<h4 id="124-&#x70B9;&#x6E38;&#x620F;"><a name="124-&#x70B9;&#x6E38;&#x620F;" class="anchor-navigation-ex-anchor" href="#124-&#x70B9;&#x6E38;&#x620F;"><i class="fa fa-link" aria-hidden="true"></i></a><a name="124-&#x70B9;&#x6E38;&#x620F;" class="plugin-anchor" href="#124-&#x70B9;&#x6E38;&#x620F;"><i class="fa fa-link" aria-hidden="true"></i></a><a href="https://leetcode-cn.com/problems/24-game/" target="_blank">1.24 &#x70B9;&#x6E38;&#x620F;</a></h4>
<p><img src="https://gitee.com/zisuu/picture/raw/master/img/20201226151018.png" alt="image-20201226151018641"></p>
<p>&#x770B;&#x5230;&#x8FD9;&#x79CD;&#x9898;&#x76EE;,&#x7B2C;&#x4E00;&#x53CD;&#x5E94;&#x662F;:&#x597D;&#x96BE;!</p>
<p>&#x4F46;&#x5176;&#x5B9E;,&#x6211;&#x4EEC;&#x8981;&#x505A;&#x5F97;&#x65E0;&#x975E;&#x662F;&#x66B4;&#x529B;&#x679A;&#x4E3E;,&#x600E;&#x4E48;&#x679A;&#x4E3E;&#x5462;?&#x753B;&#x51FA;&#x51B3;&#x7B56;&#x6811;:</p>
<p>(&#x6BD4;&#x5982;&#x4ECE;8&#x5F00;&#x59CB;,&#x8FD9;&#x91CC;&#x53EA;&#x5217;&#x4E3E;&#x4E86;+&#x548C;-,&#x5177;&#x4F53;&#x53EF;&#x4EE5;&#x753B;&#x4E00;&#x4E0B;&#xD7;&#x548C;&#xF7;)</p>
<p><img src="https://gitee.com/zisuu/picture/raw/master/img/20201226151656.png" alt=""></p>
<p>&#x51B3;&#x7B56;&#x6811;&#x8FD9;&#x5C31;&#x662F;&#x56DE;&#x6714;&#x5F97;&#x8FC7;&#x7A0B;,&#x4E5F;&#x5373;&#x6BCF;&#x6B21;&#x679A;&#x4E3E;&#x4E24;&#x4E2A;&#x6570;,&#x5C1D;&#x8BD5;&#x56DB;&#x79CD;&#x8FD0;&#x7B97;,&#x518D;&#x9012;&#x5F52;,&#x518D;&#x56DE;&#x6714;&#x5373;&#x53EF;</p>
<p>&#x6846;&#x67B6;:</p>
<pre><code class="lang-c++"><span class="hljs-function"><span class="hljs-keyword">bool</span> <span class="hljs-title">dfs</span><span class="hljs-params">(<span class="hljs-built_in">vector</span>&lt;<span class="hljs-keyword">int</span>&gt;nums)</span>
</span>{
    <span class="hljs-comment">//&#x8FB9;&#x754C;</span>
    <span class="hljs-keyword">if</span>()
        <span class="hljs-comment">////</span>
    <span class="hljs-keyword">for</span>(<span class="hljs-keyword">int</span> i=<span class="hljs-number">0</span>;i&lt;nums.size();i++){
        <span class="hljs-keyword">for</span>(<span class="hljs-keyword">int</span> j=<span class="hljs-number">0</span>;j&lt;nums.size();j++){
            <span class="hljs-keyword">if</span>(i!=j){
                <span class="hljs-built_in">vector</span>&lt;<span class="hljs-keyword">int</span>&gt; temp;<span class="hljs-comment">//&#x5B58;&#x653E;nums&#x4E2D;&#x9664;&#x4E86;i,j&#x4E0B;&#x6807;&#x5F97;&#x522B;&#x7684;&#x6570;&#x636E;</span>
                /......./
                <span class="hljs-comment">//&#x52A0;</span>
                temp.push_back(nums[i]+nums[j]);
                <span class="hljs-keyword">if</span>(dfs(temp))
                    <span class="hljs-keyword">return</span> <span class="hljs-literal">true</span>;
                temp.pop_back();
                <span class="hljs-comment">//&#x51CF;</span>
                temp.push_back(nums[i]-nums[j]);
                <span class="hljs-keyword">if</span>(dfs(temp))
                    <span class="hljs-keyword">return</span> <span class="hljs-literal">true</span>;
                temp.pop_back();
                <span class="hljs-comment">//&#x4E58;,&#x9664;</span>
                .....
            }
        }
    }
}
</code></pre>
<pre><code class="lang-c++"><span class="hljs-keyword">class</span> Solution {
<span class="hljs-keyword">public</span>:
    <span class="hljs-function"><span class="hljs-keyword">bool</span> <span class="hljs-title">dfs</span><span class="hljs-params">(<span class="hljs-built_in">vector</span>&lt;<span class="hljs-keyword">double</span>&gt;nums)</span>
    </span>{
        <span class="hljs-keyword">if</span>(nums.size()==<span class="hljs-number">1</span>)
        {
            <span class="hljs-keyword">return</span> <span class="hljs-built_in">fabs</span>(nums[<span class="hljs-number">0</span>]<span class="hljs-number">-24</span>)&lt;<span class="hljs-number">1e-6</span>;
        }
        <span class="hljs-keyword">for</span>(<span class="hljs-keyword">int</span> i=<span class="hljs-number">0</span>;i&lt;nums.size();i++)
        {
            <span class="hljs-keyword">for</span>(<span class="hljs-keyword">int</span> j=<span class="hljs-number">0</span>;j&lt;nums.size();j++)
            {
                <span class="hljs-keyword">if</span>(i==j)
                    <span class="hljs-keyword">continue</span>;
                <span class="hljs-built_in">vector</span>&lt;<span class="hljs-keyword">double</span>&gt; temp;
                <span class="hljs-keyword">double</span> n1=nums[i];
                <span class="hljs-keyword">double</span> n2=nums[j];
                <span class="hljs-keyword">for</span>(<span class="hljs-keyword">int</span> k=<span class="hljs-number">0</span>;k&lt;nums.size();k++)
                {
                    <span class="hljs-keyword">if</span> (k!=i&amp;&amp;k!=j)
                        temp.push_back((<span class="hljs-keyword">double</span>)nums[k]);
                }
                <span class="hljs-keyword">for</span>(<span class="hljs-keyword">int</span> type=<span class="hljs-number">0</span>;type&lt;<span class="hljs-number">4</span>;type++)
                {

                    <span class="hljs-keyword">if</span>(type==<span class="hljs-number">0</span>)
                        temp.push_back(n1+n2);
                    <span class="hljs-keyword">if</span>(type==<span class="hljs-number">1</span>)
                        temp.push_back(n1-n2);
                    <span class="hljs-keyword">if</span>(type==<span class="hljs-number">2</span>)
                        temp.push_back(n1*n2);
                    <span class="hljs-keyword">if</span>(type==<span class="hljs-number">3</span>)
                    {
                        <span class="hljs-keyword">if</span>(n2!=<span class="hljs-number">0</span>)
                            temp.push_back(n1/n2);
                        <span class="hljs-keyword">else</span>
                            <span class="hljs-keyword">continue</span>;
                    }
                    <span class="hljs-keyword">if</span>(dfs(temp))
                        <span class="hljs-keyword">return</span> <span class="hljs-literal">true</span>;
                    temp.pop_back();
                }
            }
        }
        <span class="hljs-keyword">return</span> <span class="hljs-literal">false</span>;
    }
    <span class="hljs-function"><span class="hljs-keyword">bool</span> <span class="hljs-title">judgePoint24</span><span class="hljs-params">(<span class="hljs-built_in">vector</span>&lt;<span class="hljs-keyword">int</span>&gt;&amp; nums)</span> </span>{
        <span class="hljs-built_in">vector</span>&lt;<span class="hljs-keyword">double</span>&gt; n;
        <span class="hljs-keyword">for</span>(<span class="hljs-keyword">auto</span> k:nums)
            n.push_back((<span class="hljs-keyword">double</span>)k*<span class="hljs-number">1.0</span>);
        <span class="hljs-keyword">return</span> dfs(n);
    }
};
</code></pre>
<h4 id="2&#x6240;&#x6709;&#x53EF;&#x80FD;&#x7684;&#x8DEF;&#x5F84;"><a name="2&#x6240;&#x6709;&#x53EF;&#x80FD;&#x7684;&#x8DEF;&#x5F84;" class="anchor-navigation-ex-anchor" href="#2&#x6240;&#x6709;&#x53EF;&#x80FD;&#x7684;&#x8DEF;&#x5F84;"><i class="fa fa-link" aria-hidden="true"></i></a><a name="2&#x6240;&#x6709;&#x53EF;&#x80FD;&#x7684;&#x8DEF;&#x5F84;" class="plugin-anchor" href="#2&#x6240;&#x6709;&#x53EF;&#x80FD;&#x7684;&#x8DEF;&#x5F84;"><i class="fa fa-link" aria-hidden="true"></i></a>2.<a href="https://leetcode-cn.com/problems/all-paths-from-source-to-target/" target="_blank">&#x6240;&#x6709;&#x53EF;&#x80FD;&#x7684;&#x8DEF;&#x5F84;</a></h4>
<p><img src="https://gitee.com/zisuu/picture/raw/master/img/20201227113513.png" alt="image-20201227113512998"></p>
<p>&#x8FD8;&#x662F;&#x4E00;&#x6837;&#x7684;&#x8001;&#x5957;&#x8DEF;,&#x753B;&#x51B3;&#x7B56;&#x6811;&#x5C31;&#x4F1A;&#x6709;&#x7B54;&#x6848;</p>
<pre><code class="lang-c++"><span class="hljs-keyword">class</span> Solution {
<span class="hljs-keyword">public</span>:
<span class="hljs-built_in">vector</span>&lt;<span class="hljs-built_in">vector</span>&lt;<span class="hljs-keyword">int</span>&gt;&gt; result;
<span class="hljs-built_in">vector</span>&lt;<span class="hljs-keyword">bool</span>&gt; flag;
<span class="hljs-keyword">int</span> target;

<span class="hljs-function"><span class="hljs-keyword">void</span> <span class="hljs-title">dfs</span><span class="hljs-params">(<span class="hljs-built_in">vector</span>&lt;<span class="hljs-keyword">int</span>&gt; arr,<span class="hljs-keyword">int</span> i,<span class="hljs-built_in">vector</span>&lt;<span class="hljs-built_in">vector</span>&lt;<span class="hljs-keyword">int</span>&gt;&gt;&amp; graph)</span></span>{
    flag[i]= <span class="hljs-literal">true</span>;
    <span class="hljs-keyword">if</span>(i==target){
        result.push_back(arr);
        <span class="hljs-keyword">return</span>;
    }
    <span class="hljs-keyword">if</span>(arr.size()&gt;target+<span class="hljs-number">1</span>)<span class="hljs-keyword">return</span>;
    <span class="hljs-keyword">for</span> (<span class="hljs-keyword">int</span> j = <span class="hljs-number">0</span>; j &lt;graph[i].size(); ++j) {
            arr.push_back(graph[i][j]);
            dfs(arr,graph[i][j],graph);
            arr.pop_back();
    }
}
<span class="hljs-built_in">vector</span>&lt;<span class="hljs-built_in">vector</span>&lt;<span class="hljs-keyword">int</span>&gt;&gt; allPathsSourceTarget(<span class="hljs-built_in">vector</span>&lt;<span class="hljs-built_in">vector</span>&lt;<span class="hljs-keyword">int</span>&gt;&gt;&amp; graph) {
    <span class="hljs-keyword">int</span> size=graph.size();
    target=size<span class="hljs-number">-1</span>;
    flag=<span class="hljs-built_in">vector</span>&lt;<span class="hljs-keyword">bool</span>&gt;(size+<span class="hljs-number">1</span>, <span class="hljs-literal">false</span>);
    dfs(<span class="hljs-built_in">vector</span>&lt;<span class="hljs-keyword">int</span>&gt;{<span class="hljs-number">0</span>},<span class="hljs-number">0</span>,graph);
    <span class="hljs-keyword">return</span> result;
}
};
</code></pre>
<h4 id="3&#x7535;&#x8BDD;&#x53F7;&#x7801;&#x7684;&#x5B57;&#x6BCD;&#x7EC4;&#x5408;"><a name="3&#x7535;&#x8BDD;&#x53F7;&#x7801;&#x7684;&#x5B57;&#x6BCD;&#x7EC4;&#x5408;" class="anchor-navigation-ex-anchor" href="#3&#x7535;&#x8BDD;&#x53F7;&#x7801;&#x7684;&#x5B57;&#x6BCD;&#x7EC4;&#x5408;"><i class="fa fa-link" aria-hidden="true"></i></a><a name="3&#x7535;&#x8BDD;&#x53F7;&#x7801;&#x7684;&#x5B57;&#x6BCD;&#x7EC4;&#x5408;" class="plugin-anchor" href="#3&#x7535;&#x8BDD;&#x53F7;&#x7801;&#x7684;&#x5B57;&#x6BCD;&#x7EC4;&#x5408;"><i class="fa fa-link" aria-hidden="true"></i></a>3.<a href="https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number/" target="_blank">&#x7535;&#x8BDD;&#x53F7;&#x7801;&#x7684;&#x5B57;&#x6BCD;&#x7EC4;&#x5408;</a></h4>
<p><img src="C:\Users\86180\AppData\Roaming\Typora\typora-user-images\image-20201227114635634.png" alt="image-20201227114635634"></p>
<p>&#x51B3;&#x7B56;&#x6811;&#x5982;&#x4E0B;:</p>
<p><img src="C:\Users\86180\AppData\Roaming\Typora\typora-user-images\image-20201227114628467.png" alt="image-20201227114628467"></p>
<pre><code class="lang-c++"><span class="hljs-meta">#<span class="hljs-meta-keyword">include</span><span class="hljs-meta-string">&lt;bits/stdc++.h&gt;</span></span>
<span class="hljs-keyword">using</span> <span class="hljs-keyword">namespace</span> <span class="hljs-built_in">std</span>;
<span class="hljs-keyword">class</span> Solution {
<span class="hljs-keyword">public</span>:
    <span class="hljs-built_in">vector</span>&lt;<span class="hljs-built_in">string</span>&gt; result;
    <span class="hljs-built_in">vector</span>&lt;<span class="hljs-built_in">string</span>&gt; num={<span class="hljs-string">&quot;&quot;</span>,<span class="hljs-string">&quot;abc&quot;</span>,<span class="hljs-string">&quot;def&quot;</span>,<span class="hljs-string">&quot;ghi&quot;</span>,<span class="hljs-string">&quot;jkl&quot;</span>,<span class="hljs-string">&quot;mno&quot;</span>,<span class="hljs-string">&quot;pqrs&quot;</span>,<span class="hljs-string">&quot;tuv&quot;</span>,<span class="hljs-string">&quot;wxyz&quot;</span>};
    <span class="hljs-function"><span class="hljs-keyword">void</span> <span class="hljs-title">dfs</span><span class="hljs-params">(<span class="hljs-built_in">string</span> digit,<span class="hljs-keyword">int</span> cur,<span class="hljs-built_in">string</span> temp)</span>
    </span>{
        <span class="hljs-keyword">if</span>(temp.size()==digit.size())
        {
            result.push_back(temp);
            <span class="hljs-keyword">return</span>;
        }
        <span class="hljs-keyword">for</span>(<span class="hljs-keyword">int</span> i=cur;i&lt;digit.size();i++)
        {
            <span class="hljs-keyword">int</span> index=digit[i]-<span class="hljs-string">&apos;0&apos;</span><span class="hljs-number">-1</span>;
            <span class="hljs-keyword">for</span>(<span class="hljs-keyword">int</span> j=<span class="hljs-number">0</span>;j&lt;num[index].size();j++)
            {
                temp.push_back(num[index][j]);
                dfs(digit,i+<span class="hljs-number">1</span>,temp);
                temp.pop_back();
            }
        }
    }
    <span class="hljs-built_in">vector</span>&lt;<span class="hljs-built_in">string</span>&gt; letterCombinations(<span class="hljs-built_in">string</span> digits) {
        <span class="hljs-keyword">if</span>(digits==<span class="hljs-string">&quot;&quot;</span>)
            <span class="hljs-keyword">return</span> result;
        dfs(digits,<span class="hljs-number">0</span>,<span class="hljs-string">&quot;&quot;</span>);
        <span class="hljs-keyword">return</span> result;
    }
};
</code></pre>
<h4 id="4&#x706B;&#x67F4;&#x62FC;&#x6B63;&#x65B9;&#x5F62;"><a name="4&#x706B;&#x67F4;&#x62FC;&#x6B63;&#x65B9;&#x5F62;" class="anchor-navigation-ex-anchor" href="#4&#x706B;&#x67F4;&#x62FC;&#x6B63;&#x65B9;&#x5F62;"><i class="fa fa-link" aria-hidden="true"></i></a><a name="4&#x706B;&#x67F4;&#x62FC;&#x6B63;&#x65B9;&#x5F62;" class="plugin-anchor" href="#4&#x706B;&#x67F4;&#x62FC;&#x6B63;&#x65B9;&#x5F62;"><i class="fa fa-link" aria-hidden="true"></i></a><a href="https://leetcode-cn.com/problems/matchsticks-to-square/" target="_blank">4.&#x706B;&#x67F4;&#x62FC;&#x6B63;&#x65B9;&#x5F62;</a></h4>
<p><img src="https://gitee.com/zisuu/picture/raw/master/img/20201227115558.png" alt="image-20201227115558719">\</p>
<p>&#x8FD9;&#x9898;&#x70B8;&#x4E00;&#x770B;&#x548C;24&#x70B9;&#x6E38;&#x620F;&#x5F88;&#x770B;,&#x518D;&#x8FDB;&#x4E00;&#x6B65;&#x60F3;</p>
<p>&#x6211;&#x4EEC;&#x7684;&#x6700;&#x7EC8;&#x76EE;&#x7684;&#x662F;&#x4E3A;&#x4E86;&#x5F97;&#x5230;&#x56DB;&#x6761;&#x8FB9;,&#x6240;&#x4EE5;&#x65E0;&#x9700;&#x50CF;24&#x70B9;&#x90A3;&#x6837;&#x679A;&#x4E3E;&#x67D0;&#x4E24;&#x6761;&#x8FB9;&#x76F8;&#x52A0;</p>
<p>&#x800C;&#x662F;&#x76F4;&#x63A5;&#x679A;&#x4E3E;&#x5C06;&#x5F53;&#x70B9;&#x8868;&#x52A0;&#x5165;&#x5230;&#x56DB;&#x6761;&#x8FB9;&#x4E2D;&#x7684;&#x67D0;&#x4E00;&#x6761;:</p>
<p>&#x5982;&#x4E0B;:</p>
<p><img src="https://gitee.com/zisuu/picture/raw/master/img/20201227120446.png" alt="image-20201227120446635"></p>
<pre><code class="lang-c++"><span class="hljs-keyword">class</span> Solution {
<span class="hljs-keyword">public</span>:
    <span class="hljs-function"><span class="hljs-keyword">bool</span> <span class="hljs-title">makesquare</span><span class="hljs-params">(<span class="hljs-built_in">vector</span>&lt;<span class="hljs-keyword">int</span>&gt;&amp; nums)</span> </span>{
       <span class="hljs-comment">//&#x4F18;&#x5316;&#x4E00;,&#x5148;&#x6392;&#x5E8F;</span>
        sort(nums.begin(), nums.end(), greater&lt;<span class="hljs-keyword">int</span>&gt;());
        <span class="hljs-keyword">auto</span> sum = accumulate(nums.begin(), nums.end(), <span class="hljs-number">0</span>);
        <span class="hljs-keyword">if</span> (sum % <span class="hljs-number">4</span> != <span class="hljs-number">0</span> || nums.size() &lt; <span class="hljs-number">4</span>) {
            <span class="hljs-keyword">return</span> <span class="hljs-literal">false</span>;
        }

        <span class="hljs-keyword">int</span> target = sum / <span class="hljs-number">4</span>;
        <span class="hljs-built_in">vector</span>&lt;<span class="hljs-keyword">int</span>&gt; side(<span class="hljs-number">4</span>, <span class="hljs-number">0</span>);
        <span class="hljs-keyword">return</span> backtrack(nums, <span class="hljs-number">0</span>, target, side);
    }

<span class="hljs-keyword">private</span>:
    <span class="hljs-function"><span class="hljs-keyword">bool</span> <span class="hljs-title">backtrack</span><span class="hljs-params">(<span class="hljs-built_in">vector</span>&lt;<span class="hljs-keyword">int</span>&gt;&amp; nums, <span class="hljs-keyword">int</span> start, <span class="hljs-keyword">int</span> target, <span class="hljs-built_in">vector</span>&lt;<span class="hljs-keyword">int</span>&gt;&amp; side)</span> </span>{
        <span class="hljs-keyword">if</span> (start == nums.size()) {
            <span class="hljs-comment">// This implies 4 sides all each to target, since target = sum / 4</span>
            <span class="hljs-keyword">return</span> (side[<span class="hljs-number">0</span>] == side[<span class="hljs-number">1</span>] &amp;&amp; side[<span class="hljs-number">1</span>] == side[<span class="hljs-number">2</span>] &amp;&amp; side[<span class="hljs-number">2</span>] == side[<span class="hljs-number">3</span>]);
        }

        <span class="hljs-comment">// Try to use stick nums[start] in this round, no need to loop nums[i],</span>
        <span class="hljs-comment">// keep increase start in every level should be enough</span>
        <span class="hljs-keyword">for</span> (<span class="hljs-keyword">int</span> i = <span class="hljs-number">0</span>; i &lt; <span class="hljs-number">4</span>; i++) {
            <span class="hljs-comment">//&#x4F18;&#x5316;&#x4E8C;</span>
            <span class="hljs-keyword">if</span> (side[i] + nums[start] &gt; target) {
                <span class="hljs-keyword">continue</span>;
            }

            <span class="hljs-comment">// Make choice</span>
            side[i] += nums[start];
            <span class="hljs-keyword">if</span> (backtrack(nums, start + <span class="hljs-number">1</span>, target, side)) {
                <span class="hljs-keyword">return</span> <span class="hljs-literal">true</span>;
            }
            <span class="hljs-comment">// Undo choice</span>
            side[i] -= nums[start];
        }

        <span class="hljs-keyword">return</span> <span class="hljs-literal">false</span>;
    }
};
</code></pre>

<script>console.log("plugin-popup....");document.onclick = function(e){ e.target.tagName === "IMG" && window.open(e.target.src,e.target.src)}</script><style>img{cursor:pointer}</style>
                                
                                </section>
                            
    </div>
    <div class="search-results">
        <div class="has-results">
            
            <h1 class="search-results-title"><span class='search-results-count'></span> results matching "<span class='search-query'></span>"</h1>
            <ul class="search-results-list"></ul>
            
        </div>
        <div class="no-results">
            
            <h1 class="search-results-title">No results matching "<span class='search-query'></span>"</h1>
            
        </div>
    </div>
</div>

                        </div>
                    </div>
                
            </div>

            
                
                <a href="2.深度优先搜索.html" class="navigation navigation-prev " aria-label="Previous page: 2.深度优先搜索算法">
                    <i class="fa fa-angle-left"></i>
                </a>
                
                
                <a href="3.广度优先搜索.html" class="navigation navigation-next " aria-label="Next page: 3.广度优先搜索算法">
                    <i class="fa fa-angle-right"></i>
                </a>
                
            
        
    </div>

    <script>
        var gitbook = gitbook || [];
        gitbook.push(function() {
            gitbook.page.hasChanged({"page":{"title":"2.深搜题目集","level":"4.4","depth":1,"next":{"title":"3.广度优先搜索算法","level":"4.5","depth":1,"path":"算法/3.广度优先搜索.md","ref":"算法/3.广度优先搜索.md","articles":[]},"previous":{"title":"2.深度优先搜索算法","level":"4.3","depth":1,"path":"算法/2.深度优先搜索.md","ref":"算法/2.深度优先搜索.md","articles":[]},"dir":"ltr"},"config":{"plugins":["-sharing","splitter","expandable-chapters-small","anchors","sharing-plus","anchor-navigation-ex","favicon","expandable-chapters","toggle-chapters","back-to-top-button","code","-lunr","-search","search-pro","pageview-count","popup","livereload"],"styles":{"website":"./styles/website.css"},"pluginsConfig":{"livereload":{},"splitter":{},"search-pro":{},"sharing-plus":{"qq":false,"all":["facebook","google","twitter","instapaper","linkedin","pocket","stumbleupon"],"douban":false,"facebook":true,"weibo":false,"instapaper":false,"whatsapp":false,"hatenaBookmark":false,"twitter":true,"messenger":false,"line":false,"vk":false,"pocket":true,"google":false,"viber":false,"stumbleupon":false,"qzone":false,"linkedin":false},"popup":{},"code":{"copyButtons":true},"fontsettings":{"theme":"white","family":"sans","size":2},"highlight":{},"anchor-navigation-ex":{"associatedWithSummary":true,"float":{"floatIcon":"fa fa-navicon","level1Icon":"","level2Icon":"","level3Icon":"","showLevelIcon":false},"mode":"float","multipleH1":true,"pageTop":{"level1Icon":"","level2Icon":"","level3Icon":"","showLevelIcon":false},"printLog":false,"showGoTop":true,"showLevel":false},"favicon":{},"back-to-top-button":{},"pageview-count":{},"expandable-chapters-small":{},"sharing":{"qq":false,"all":["google","facebook","weibo","twitter","qq","qzone","linkedin","pocket"],"douban":false,"facebook":false,"weibo":false,"instapaper":false,"whatsapp":false,"hatenaBookmark":false,"twitter":false,"messenger":false,"line":false,"vk":false,"pocket":false,"google":false,"viber":false,"stumbleupon":false,"qzone":false,"linkedin":false},"theme-default":{"styles":{"website":"styles/website.css","pdf":"styles/pdf.css","epub":"styles/epub.css","mobi":"styles/mobi.css","ebook":"styles/ebook.css","print":"styles/print.css"},"showLevel":false},"anchors":{},"toggle-chapters":{},"expandable-chapters":{}},"theme":"default","author":"hzh","pdf":{"pageNumbers":true,"fontSize":12,"fontFamily":"Arial","paperSize":"a4","chapterMark":"pagebreak","pageBreaksBefore":"/","margin":{"right":62,"left":62,"top":56,"bottom":56}},"structure":{"langs":"LANGS.md","readme":"README.md","glossary":"GLOSSARY.md","summary":"SUMMARY.md"},"variables":{},"title":"计算机 ,java , 大数据 基础知识体系","language":"zh-hans","gitbook":"3.2.3"},"file":{"path":"算法/2.深度优先搜索题目集.md","mtime":"2020-12-27T06:19:59.810Z","type":"markdown"},"gitbook":{"version":"3.2.3","time":"2020-12-30T11:12:56.611Z"},"basePath":"..","book":{"language":""}});
        });
    </script>
</div>

        
    <script src="../gitbook/gitbook.js"></script>
    <script src="../gitbook/theme.js"></script>
    
        
        <script src="../gitbook/gitbook-plugin-splitter/splitter.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-expandable-chapters-small/expandable-chapters-small.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-sharing-plus/buttons.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-expandable-chapters/expandable-chapters.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-toggle-chapters/toggle.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-back-to-top-button/plugin.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-code/plugin.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-search-pro/jquery.mark.min.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-search-pro/search.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-pageview-count/plugin.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-livereload/plugin.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-fontsettings/fontsettings.js"></script>
        
    

    </body>
</html>

